Time-Independent Gossiping on Full-Port Tori

نویسندگان

  • Ulrich Meyer
  • Jop F. Sibeyn
چکیده

Near-optimal gossiping algorithms are given for twoand higher dimensional tori. It is assumed that the amount of data each PU contributes is so large that start-up time may be neglected. For twodimensional tori, a previous algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In all steps of our algorithms, the PUs forward the received packets in the same way.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gossiping Large Packets on Full-Port Tori

Near-optimal gossiping algorithms are given for two-and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For two-dimensional tori, an earlier algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In our algorithms, in all steps, the PUs forward the received packets in the ...

متن کامل

Oblivious Gossiping on Tori

Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern. In contrast, the processing units in our algorithm forward the received packets always in the same way. We thus achieve ...

متن کامل

Gossiping in Cayley Graphs by Packets

Gossiping (also called total exchange or all-to-all communication) is the process of information diiusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider here gossiping in the store-and-forward, full-duplex and-port (or shouting) model. In such a model, the protocol consists of a sequence of rounds and during each round, ea...

متن کامل

Toward Optimal Complete Exchange on Wormhole-Routed Tori

ÐIn this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. On tori of equal size along each dimension, our algorithms use both asymptotically optimal startup and transmission time. The results are characterized by several interesting features: 1) the use of gather-scatter tree to achieve opti...

متن کامل

Neighbourhood Gossiping in Hypercubes

In the neighbourhood gossiping problem, each node of a network starts with a unique message and must learn the messages of all of its neighbours. In this paper, we prove upper and lower bounds for neighbourhood gossiping in hypercubes under the single-port half-duplex and single-port full-duplex communication models.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998